Weight Enumerators and Cardinalities for Number-Theoretic Codes

نویسندگان

چکیده

The number-theoretic code is a class of codes defined by single or multiple congruences. These are mainly used for correcting insertion and deletion errors, asymmetric errors. This paper presents formula generalization the complete weight enumerator codes. allows us to derive enumerators cardinalities As special case, this provides Hamming non-binary Tenengolts’ codes, deletion. Moreover, we show that deduces MacWilliams identity linear over ring integers modulo $r$ .

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complete Weight Enumerators of Some Linear Codes

Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for an odd prime p, we determine the explicit complete weight enumerators of two classes of linear codes over Fp and they may have applications in cryptography and secret sharing schemes. Moreover, some examples are included to illustrate our results. Index Terms Linear code, complete weight e...

متن کامل

Support Weight Enumerators and Coset Weight Distributions of Isodual Codes

In this paper various methods for computing the support weight enumerators of binary, linear, even, isodual codes are described. It is shown that there exist relationships between support weight enumerators and coset weight distributions of a code that can be used to compute partial information about one set of these code invariants from the other. The support weight enumerators and complete co...

متن کامل

Computing Symmetrized Weight Enumerators for Lifted Quadratic Residue Codes

The paper describes a method to determine symmetrized weight enumerators of Zpm -linear codes based on the notion of a disjoint weight enumerator. Symmetrized weight enumerators are given for the lifted quadratic residue codes of length 24 modulo 2 and modulo 3 , for any positive m .

متن کامل

MacWilliams identities for poset level weight enumerators of linear codes

Codes over various metrics such as Rosenbloom-Tsfasman (RT), Lee, etc. have been considered. Recently, codes over poset metrics have been studied. Poset metric is a great generalization of many metrics especially the well-known ones such as the RT and the Hamming metrics. Poset metric can be realized on the channels with localized error occurrences. It has been shown that MacWilliams identities...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2022

ISSN: ['0018-9448', '1557-9654']

DOI: https://doi.org/10.1109/tit.2022.3184776